Nomadic path optimizing model under multi-factor constraints
نویسندگان
چکیده
منابع مشابه
Experimental Multi-Vehicle Path Coordination under Communication Connectivity Constraints
The main contribution of this paper is the experimental validation of a decentralized Receding Horizon Mixed Integer Nonlinear Programming (RH-MINLP) framework that can be used to solve the Multi-Vehicle Path Coordination (MVPC) problem. The MVPC problem features path-constrained vehicles that begin their transit from a fixed starting point and move towards a goal point along fixed paths so as ...
متن کاملOptimizing phylogenetic diversity under constraints.
Phylogenetic diversity (PD) is a measure of the extent to which different subsets of taxa span an evolutionary tree, and provides a quantitative tool for studying biodiversity conservation. Recently, it was shown that the problem of finding subsets of taxa of given size to maximize PD can be efficiently solved by a greedy algorithm. In this paper, we extend this earlier work, beginning with a m...
متن کاملOptimizing a bi-objective vendor-managed inventory of multi-product EPQ model for a green supply chain with stochastic constraints
In this paper, a bi-objective multi-product single-vendor single-buyer supply chain problem is studied under green vendor-managed inventory (VMI) policy based on the economic production quantity (EPQ) model. To bring the model closer to real-world supply chain, four constraints of model including backordering cost, number of orders, production budget and warehouse space are considered stochasti...
متن کاملOptimizing Query Answering under Ontological Constraints
Ontological queries are evaluated against a database combined with ontological constraints. Answering such queries is a challenging new problem for database research. For many ontological modelling languages, query answering can be solved via query rewriting: given a conjunctive query and an ontology, the query can be transformed into a first-order query, called the perfect rewriting, that take...
متن کاملAny-Com Multi-robot Path-Planning with Dynamic Teams: Multi-robot Coordination under Communication Constraints
We are interested in finding solutions to the multi-robot path-planning problem that have guarantees on completeness, are robust to communication failure, and incorporate varying team size. In this paper we present an algorithm that addresses the complete multi-robot path-planning problem from two different angles. First, dynamic teams are used to minimize computational complexity per robot and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2019
ISSN: 1877-0509
DOI: 10.1016/j.procs.2019.12.039